Comparison of priority rules in pattern matching and term rewriting
نویسندگان
چکیده
منابع مشابه
Term Rewriting with Conditionals and Priority Orderings
Conditional re,vriting and priority re,vriting are two recent generalizations of term rewriting systems. In the former, each re\vrite rule is accompanied by an antecedent which must be sho,vn to hold before rewriting can OCCUI. In the latter, re,vrite rules can be used only' in a particular order. We compare these formalisms: neither formalism encompasses the other in a practical sense, but we ...
متن کاملthe effects of keyword and context methods on pronunciation and receptive/ productive vocabulary of low-intermediate iranian efl learners: short-term and long-term memory in focus
از گذشته تا کنون، تحقیقات بسیاری صورت گرفته است که همگی به گونه ای بر مثمر ثمر بودن استفاده از استراتژی های یادگیری لغت در یک زبان بیگانه اذعان داشته اند. این تحقیق به بررسی تاثیر دو روش مختلف آموزش واژگان انگلیسی (کلیدی و بافتی) بر تلفظ و دانش لغوی فراگیران ایرانی زیر متوسط زبان انگلیسی و بر ماندگاری آن در حافظه می پردازد. به این منظور، تعداد شصت نفر از زبان آموزان ایرانی هشت تا چهارده ساله با...
15 صفحه اولassessment of deep word knowledge in elementary and advanced iranian efl learners: a comparison of selective and productive wat tasks
testing plays a vital role in any language teaching program. it allows teachers and stakeholders, including program administrators, parents, admissions officers and prospective employers to be assured that the learners are progressing according to an accepted standard (douglas, 2010). the problems currently facing language testers have both practical and theoretical implications but the first i...
comparison of the amount of debris extruded apically in two rotary techniques: flexmaster and m2
چکیده ندارد.
15 صفحه اولLazy AC-Pattern Matching for Rewriting
We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of a pattern-matching problem are stored in a lazy list composed of a first substitution at the head and a non-evaluated object that encodes the remaining computations. We integrate the lazy AC-matching in a strategy language: rewriting rule and strategy application produce a lazy list of terms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1991
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(08)80109-5